Generalizing Variable Elimination in Bayesian Networks
نویسنده
چکیده
This paper describes a generalized version of the variable elimination algorithm for Bayesian networks. Variable elimination computes the marginal probability for some specified set of variables in a network. The algorithm consists of a single pass through a list of data structures called buckets. The generalization presented here adds a second pass to the algorithm and produces the marginal probability density for every variable in the buckets. The algorithm and the presentation focus on algebraic operations, striving for simplicity and easy of understanding. The algorithm has been implemented in the JavaBayes system, a freely distributed system for the construction and manipulation of Bayesian networks.
منابع مشابه
On Variable Elimination in Discrete Bayesian Network Inference
We are interested in proving that variable elimination (VE) in discrete Bayesian networks always yields a clearly structured conditional probability table (CPT) rather than a potential as universally stated. A Bayesian network consists of a directed acyclic graph and a corresponding set of CPTs. Based on the conditional independencies holding in the directed acyclic graph, the product of the CP...
متن کاملCompiling Bayesian Networks Using Variable Elimination
Compiling Bayesian networks has proven an effective approach for inference that can utilize both global and local network structure. In this paper, we define a new method of compiling based on variable elimination (VE) and Algebraic Decision Diagrams (ADDs). The approach is important for the following reasons. First, it exploits local structure much more effectively than previous techniques bas...
متن کاملThe CPT Structure of Variable Elimination in Discrete Bayesian Networks
We show that a conditional probability table (CPT) is obtained after every multiplication and every marginalization step when eliminating variables from a discrete Bayesian network. The main advantage of our work is an improvement in presentation. The probability distributions constructed during variable elimination in Bayesian networks have always been denoted as potentials. Since CPTs are a s...
متن کاملBelief updating in Bayesian networks by using a criterion of minimum time
Variable elimination (VE) and clustering algorithms (CAs) are two widely used algorithms for exact inference in Bayesian networks. Both the problem of finding an optimal variable elimination ordering in VE and the problem of finding an optimal graph triangulation in CAs are NP-complete, although greedy algorithms work well in practice. Usually, VE selects the next variable to be eliminated such...
متن کاملA Fully Polynomial Time Approximation Scheme for Updating Credal Networks of Bounded Treewidth and Number of Variable States
Credal networks lift the precise probability assumption of Bayesian networks, enabling a richer representation of uncertainty in the form of closed convex sets of probability measures. The increase in expressiveness comes at the expense of higher computational costs. In this paper we present a new algorithm which is an extension of the wellknown variable elimination algorithm for computing post...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000